TSTP Solution File: ALG257^2 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : ALG257^2 : TPTP v8.1.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Thu Jul 14 17:57:47 EDT 2022
% Result : Theorem 0.58s 0.81s
% Output : Proof 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 25
% Syntax : Number of formulae : 31 ( 12 unt; 7 typ; 6 def)
% Number of atoms : 59 ( 22 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 97 ( 8 ~; 6 |; 0 &; 66 @)
% ( 6 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 15 con; 0-2 aty)
% Number of variables : 32 ( 5 ^ 27 !; 0 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
thf(ty_subst,type,
subst: $tType ).
thf(ty_term,type,
term: $tType ).
thf(ty_eigen__2,type,
eigen__2: term ).
thf(ty_eigen__0,type,
eigen__0: term ).
thf(ty_ap,type,
ap: term > term > term ).
thf(ty_id,type,
id: subst ).
thf(ty_sub,type,
sub: term > subst > term ).
thf(h0,assumption,
! [X1: term > $o,X2: term] :
( ( X1 @ X2 )
=> ( X1 @ ( eps__0 @ X1 ) ) ),
introduced(assumption,[]) ).
thf(eigendef_eigen__0,definition,
( eigen__0
= ( eps__0
@ ^ [X1: term] :
~ ! [X2: term,X3: term,X4: term] :
( ( ( ap @ ( sub @ X1 @ id ) @ X3 )
= ( ap @ ( sub @ X2 @ id ) @ X4 ) )
=> ( X3 = X4 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__0])]) ).
thf(eigendef_eigen__2,definition,
( eigen__2
= ( eps__0
@ ^ [X1: term] :
~ ! [X2: term,X3: term] :
( ( ( ap @ ( sub @ eigen__0 @ id ) @ X2 )
= ( ap @ ( sub @ X1 @ id ) @ X3 ) )
=> ( X2 = X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[eigen__2])]) ).
thf(sP1,plain,
( sP1
<=> ! [X1: term,X2: term,X3: term,X4: term] :
( ( ( ap @ X1 @ X3 )
= ( ap @ X2 @ X4 ) )
=> ( X3 = X4 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: term,X2: term] :
( ( ( ap @ ( sub @ eigen__0 @ id ) @ X1 )
= ( ap @ ( sub @ eigen__2 @ id ) @ X2 ) )
=> ( X1 = X2 ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ! [X1: term,X2: term,X3: term,X4: term] :
( ( ( ap @ ( sub @ X1 @ id ) @ X3 )
= ( ap @ ( sub @ X2 @ id ) @ X4 ) )
=> ( X3 = X4 ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( sP1
=> sP3 ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: term,X2: term,X3: term] :
( ( ( ap @ ( sub @ eigen__0 @ id ) @ X2 )
= ( ap @ X1 @ X3 ) )
=> ( X2 = X3 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ! [X1: term,X2: term,X3: term] :
( ( ( ap @ ( sub @ eigen__0 @ id ) @ X2 )
= ( ap @ ( sub @ X1 @ id ) @ X3 ) )
=> ( X2 = X3 ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(def_apinj2,definition,
apinj2 = sP1 ).
thf(def_hoasap,definition,
( hoasap
= ( ^ [X1: subst,X2: term,X3: subst] : ( ap @ ( sub @ X2 @ X3 ) ) ) ) ).
thf(def_hoasapinj2,definition,
( hoasapinj2
= ( ! [X1: term,X2: term,X3: term,X4: term] :
( ( ( hoasap @ id @ X1 @ id @ X3 )
= ( hoasap @ id @ X2 @ id @ X4 ) )
=> ( X3 = X4 ) ) ) ) ).
thf(def_hoasapinj2_lthm,definition,
( hoasapinj2_lthm
= ( apinj2
=> hoasapinj2 ) ) ).
thf(thm,conjecture,
sP4 ).
thf(h1,negated_conjecture,
~ sP4,
inference(assume_negation,[status(cth)],[thm]) ).
thf(1,plain,
( ~ sP1
| sP5 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP5
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(3,plain,
( sP6
| ~ sP2 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__2]) ).
thf(4,plain,
( sP3
| ~ sP6 ),
inference(eigen_choice_rule,[status(thm),assumptions([h0])],[h0,eigendef_eigen__0]) ).
thf(5,plain,
( sP4
| ~ sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(6,plain,
( sP4
| sP1 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h1,h0])],[1,2,3,4,5,6,h1]) ).
thf(8,plain,
$false,
inference(eigenvar_choice,[status(thm),assumptions([h1]),eigenvar_choice(discharge,[h0])],[7,h0]) ).
thf(0,theorem,
sP4,
inference(contra,[status(thm),contra(discharge,[h1])],[7,h1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG257^2 : TPTP v8.1.0. Bugfixed v5.2.0.
% 0.06/0.12 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.12/0.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jun 8 16:45:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.58/0.81 % SZS status Theorem
% 0.58/0.81 % Mode: mode485:USE_SINE=true:SINE_TOLERANCE=1.2:SINE_GENERALITY_THRESHOLD=4:SINE_RANK_LIMIT=4.:SINE_DEPTH=0
% 0.58/0.81 % Inferences: 7
% 0.58/0.81 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------